Performance Analysis of Gang Scheduling in a Partitionable Parallel System
نویسنده
چکیده
This paper addresses performance issues associated with job scheduling in a partitionable parallel system. Jobs consist of parallel tasks scheduled to execute concurrently on processor partitions, where each task starts at the same time and computes at the same pace. The performance of different scheduling schemes is compared over various workloads. Various performance metrics are examined. The objective is to achieve good overall performance and also small scheduling overhead. Simulated results indicate that periodic job scheduling and also scheduling which depends on the number of job insertions in the queue can succeed in these pursuits.
منابع مشابه
Scheduling Parallel and Sequential Jobs in a Partitionable Parallel System
This paper addresses performance issues associated with job scheduling in a partitionable parallel system. Jobs are characterized as sequential or parallel depending on whether their tasks have to be processed sequentially on the same processor or at different processors. Jobs that consist of parallel tasks have to be scheduled to execute concurrently on processor partitions, where each task st...
متن کاملStochastic Analysis of Gang Scheduling in Parallel and Distributed Systems
Gang scheduling is an approach for resource allocation in parallel and distributed systems that combines time-sharing with space-sharing to ensure a short response time for interactive tasks and high overall system throughput. In this paper, we present queueing theoretic models for a particular gang scheduling system under a workload representative of large-scale engineering and scientiic compu...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملScheduling Gangs in a Distributed System
In this paper we study the performance of parallel job scheduling in a distributed system. A special type of scheduling called gang scheduling is considered. In gang scheduling jobs consist of a number of interacting tasks, which are scheduled to run simultaneously on distinct processors. Two gang scheduling policies are used to schedule parallel jobs for two different types of job parallelism....
متن کاملDesign of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System
This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...
متن کامل